Detecting faults in TFTP implementations using Finite State Machines with timeouts
نویسندگان
چکیده
In this paper, we consider a test derivation strategy for testing protocol implementations based on Finite State Machines with timeouts. The strategy is applied for testing TFTP implementations. Keywords-Finete State Machine (FSM); FSM with timeouts (timed FSM); transition tour
منابع مشابه
Testing Finite State Machines Presenting Stochastic Time and Timeouts
In this paper we define a formal framework to test implementations that can be represented by the class of finite state machines introduced in [10]. First, we introduce an appropriate notion of test. Next, we provide an algorithm to derive test suites from specifications such that the constructed test suites are sound and complete with respect to two of the conformance relations introduced in [...
متن کاملDeterministic Timed Finite State Machines: Equivalence Checking and Expressive Power
There has been a growing interest in defining models of automata enriched with time. For instance, timed automata were introduced as automata extended with clocks. In this paper, we study models of timed finite state machines (TFSMs), i.e., FSMs enriched with time, which accept timed input words and generate timed output words. Here we discuss some models of TFSMs with a single clock: TFSMs wit...
متن کاملDiagnosis of Single Transition Faults in Communicating Finite State Machines
In this paper, we propose a diagnostic algorithm for the case where distributed system specifications (implementations) are given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptom...
متن کاملProtocol State Fuzzing of TLS Implementations
We describe a largely automated and systematic analysis of TLS implementations by what we call ‘protocol state fuzzing’: we use state machine learning to infer state machines from protocol implementations, using only blackbox testing, and then inspect the inferred state machines to look for spurious behaviour which might be an indication of flaws in the program logic. For detecting the presence...
متن کاملImplementation Relations for Stochastic Finite State Machines
We present a timed extension of the classical finite state machines model where time is introduced in two ways. On the one hand, timeouts can be specified, that is, we can express that if an input action is not received before a fix amount of time then the machine will change its state. On the other hand, we can associate time with the performance of actions. In this case, time will be given by...
متن کامل